Case Based Imprecision Estimates for Bayes Classifiers with the Bayesian Bootstrap
نویسندگان
چکیده
منابع مشابه
Case-Based Bayesian Network Classifiers
We propose a new approach for learning Bayesian classifiers from data. Although it relies on traditional Bayesian network (BN) learning algorithms, the effectiveness of our approach lies in its ability to organize and structure the data in such a way that allows us to represent the domain knowledge more accurately than possible in traditional BNs. We use clustering to partition the data into me...
متن کاملSelection of Tree-based Classifiers with the Bootstrap 632+ Rule
15 wardly biased as with the standard bootstrap. The use of the bootstrap 632+ rule for model evaluation in this problem constitutes a rst real application of the method. Model prediction error for the selected CART compared favorably with that estimated by Fisher's linear discriminant function. Acknowledgments Collaboration with C. Chemini and the Centro di Ecologia Alpina of Trento is gratefu...
متن کاملTractable Bayesian Learning of Tree Augmented Naive Bayes Classifiers
Bayesian classifiers such as Naive Bayes or Tree Augmented Naive Bayes (TAN) have shown excellent performance given their simplicity and heavy underlying independence assumptions. In this paper we introduce a classifier taking as basis the TAN models and taking into account uncertainty in model selection. To do this we introduce decomposable distributions over TANs and show that the expression ...
متن کاملBayes Network Classifiers for fMRI
Classifying human cognitive states using fMRI data is an interesting and challenging problem that would guide us to better understanding about human brain. In this paper we introduce TAN classifier to distinguish whether subjects are examining a sentence or a picture. Experiments show that using this TAN classifiers provides significantly better results than using Naive Bayes classifiers.
متن کاملSSV Criterion Based Discretization for Naive Bayes Classifiers
Decision tree algorithms deal with continuous variables by finding split points which provide best separation of objects belonging to different classes. Such criteria can also be used to augment methods which require or prefer symbolic data. A tool for continuous data discretization based on the SSV criterion (designed for decision trees) has been constructed. It significantly improves the perf...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Machine Learning
سال: 2005
ISSN: 0885-6125,1573-0565
DOI: 10.1007/s10994-005-5010-y